Rough sets and Boolean reasoning
نویسندگان
چکیده
In this article, we discuss methods based on the combination of rough sets and Boolean reasoning with applications in pattern recognition, machine learning, data mining and conflict analysis. 2006 Elsevier Inc. All rights reserved.
منابع مشابه
Approximate Boolean Reasoning Approach to Rough Sets and Data Mining
Many problems in rough set theory have been successfully solved by boolean reasoning (BR) approach. The disadvantage of this elegant methodology is based on its high space and time complexity. In this paper we present a modified BR approach that can overcome those difficulties. This methodology is called the approximate boolean reasoning (ABR) approach. We summarize some most recent application...
متن کاملModelling prognostic power of cardiac tests using rough sets
Rough sets (Pawlak Z. Rough Sets: Theoretical Aspects of Reasoning about Data, Dordrecht: Kluwer Academic Publishers, 1991) is a relatively new approach to representing and reasoning with incomplete and uncertain knowledge. This article introduces the basic concepts of rough sets and Boolean reasoning (Brown FM. Boolean Reasoning: The Logic of Boolean Equations, Dordrecht: Kluwer Academic Publi...
متن کاملDiscovering Stock Price Prediction Rules Using Rough Sets
The use of computational intelligence systems such as neural networks, fuzzy set, genetic algorithms, etc. for stock market predictions has been widely established. This paper presents a generic stock pricing prediction model based on rough set approach. To increase the efficiency of the prediction process, rough sets with Boolean reasoning discretization algorithm is used to discretize the dat...
متن کاملA first order, four-valued, weakly paraconsistent logic and its relation with rough sets semantics
A first order four-valued logic, called DDT, is presented in the paper as an extension of Belnap’s logic using a weak negation and establishing an appropriate semantic for the predicate calculus. The logic uses a simple algebraic structure, that is the smallest non trivial interlaced bilattice on the four truth values, thus resulting in a boolean algebra on the set of truth values. The logic is...
متن کاملHeyting algebras with Boolean operators for rough sets and information retrieval applications
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular. We argue that these generalizations are suitable for modeling relevance of documents in an Information Retrieval system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 177 شماره
صفحات -
تاریخ انتشار 2007